A New Class of (2p)B(2p+1)B d.c. Balanced Line Codes

نویسندگان

  • Eric Deliot
  • Alistair N. Coles
چکیده

A block code of the form (2p)B(2p+1)B cannot provide both d.c. balance and redundant codewords for control signals. We describe a new set of additional rules that may be applied to groups of consecutive codewords in order to provide both d.c. balance and a large control space, and show how 256 10-bit control symbols may be achieved with a d.c. balanced 4B5B code. Introduction: nBmB block coding, whereby n bits of data are mapped to m > n bits, is often used in data communication links in order to provide some redundant signal space which may be used for control signals. The transmission overhead introduced by the block code should be kept minimal, and so codes of the type nB(n+1)B are popular. It is also desirable that the size of the input data field (n) is as small as possible and is a factor of 8. These two properties enable low complexity designs for byteoriented data. The 4B5B code used by FDDI [1] and 100BaseTX [2] is an example of an nB(n+1)B code that meets these criteria. A further desirable property of a block code is that of d.c. balance. Data is often transmitted through a.c. coupled links (e.g. copper twisted pairs or optical fibres), and any d.c. content in the coded data may cause signal distortion, commonly referred to as baseline wander. A d.c. balanced code reduces baseline wander by ensuring the disparity of coded data (i.e. the difference between the number of ones and the number of zeros) is zero. For an nB(n+1)B code with n even, i.e. a (2p)B(2p+1)B code, d.c. balance can only be achieved by using two alphabets, for example one containing all codewords having positive disparity and one containing all codewords having negative disparity (there are no codewords with zero disparity). The running disparity (rd) is constrained by choosing codewords from the appropriate alphabet: if rd > 0, select a codeword having negative disparity; if rd <= 0, select a codeword having positive disparity. Unfortunately, such a scheme results in all codewords being used in the two data alphabets leaving no redundant codewords for control signalling. In practice, codes such as the FDDI 4B5B must provide some control codewords and are therefore not d.c. balanced. When n is odd, zero disparity codewords may be shared between the two alphabets leaving some redundant codewords. An example of this is the 5B6B code used by IEEE 802.12 networks [3]. However, these codes are harder to implement with byte-oriented data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A series of Siamese twin designs intersecting in a BIBD and a PBD

Let p and 2p − 1 be prime powers and p ≡ 3 (mod 4). We describe a construction of a series of Siamese twin designs with Menon parameters (4p, 2p − p, p − p) intersecting in a derived design with parameters (2p − p, p − p, p − p − 1), and a pairwise balanced design PBD(2p − p, {p, p − p}, p − p − 1). When p and 2p − 1 are primes, the derived design and the pairwise balanced design are cyclic. Fu...

متن کامل

1 A ug 2 01 7 Some new sufficient conditions for 2 p - Hamilton - biconnectedness of graphs ∗

A balanced bipartite graph G is said to be 2p-Hamilton-biconnected if for any balanced subset W of size 2p of V (G), the subgraph induced by V (G)\W is Hamilton-biconnected. In this paper, we prove that “ Let p ≥ 0 and G be a balanced bipartite graph of order 2n with minimum degree δ(G) ≥ k, where n ≥ 2k − p + 2 and k ≥ p. If the number of edges e(G) > n(n − k + p− 1) + (k+2)(k−p+1), then G is ...

متن کامل

Independent cycles and paths in bipartite balanced graphs

Bipartite graphs G = (L, R; E) and H = (L, R; E) are bi-placeabe if there is a bijection f : L ∪ R → L ∪ R such that f(L) = L and f(u)f(v) / ∈ E for every edge uv ∈ E. We prove that if G and H are two bipartite balanced graphs of order |G| = |H | = 2p ≥ 4 such that the sizes of G and H satisfy ‖ G ‖≤ 2p− 3 and ‖ H ‖≤ 2p− 2, and the maximum degree of H is at most 2, then G and H are bi-placeable...

متن کامل

Repeated-Root Self-Dual Negacyclic Codes over Finite Fields

Let Fq be a finite field with q = p , where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2p over Fq, a ≥ 1. The construction of self-dual negacyclic codes of length 2bp over Fq is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.

متن کامل

N(2D) and N(2P) metastable production by electron collisions in a D.C. glow discharge

2014 The atomic nitrogen metastable densities of N(2D) and N(2P) have been measured by optical absorption in a continuous glow dis harge. Electronic densities have been measured with a microwave resonant cavity. The evolution of N(2D) and N(2P) densities as a function of electronic density allows the estimation of the overall creation coefficient by electronic collisions CeM : e + N2 $$ e + N(2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998